“Y dice que adora piedras”

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zudiet: un sistema que genera patrones alimenticios personalizados y adaptados

Some of the biggest public health problems in the world are: physical inactivity, sedentary lifestyle, obesity, which are generating non-communicable diseases [4]; these diseases are responsible for six of every ten deaths in the world [5]. One solution to this problem is the gyms, but they are not satisfactory because of its overall vision. This generalization leads to that persons are not con...

متن کامل

Visualizing Adora Models

Most current object modeling methods and tools have weaknesses both in the concepts of hierarchical composition and in the visualization of these hierarchies. Some methods do not support hierarchical composition at all. Those methods which do, employ tools that provide explosive zoom as the only means for the visualization of hierarchies. In this paper we present an approach for the visualizati...

متن کامل

Object-oriented modeling with Adora

In this paper, we present the Adora approach to object-oriented modeling of software (Adora stands for analysis and description of requirements and architecture). The main features of Adora that distinguish it from other approaches like UML are the use of abstract objects (instead of classes) as the basis of the model, a systematic hierarchical decomposition of the modeled system and the integr...

متن کامل

Tied dice

A generalized die is a list (x1; :::; xn) of integers. For integers n 1, a b and s let D(n; a; b; s) be the set of all dice with a x1 ::: xn b and P xi = s. Two dice X and Y are tied if the number of pairs (i; j) with xi < yj equals the number of pairs (i; j) with xi > yj . We prove the following: with one exception (unique up to isomorphism), if X 6= Y 2 D(n; a; b; s) are tied dice neither of ...

متن کامل

Dice graphs

For integers n 1, a b and s let D(n; a; b; s) be the set of all lists of integers (x1; :::; xn) with a x1 ::: xn b and P xi = s. There is a graph G(n; a; b; s) with vertex-set D(n; a; b; s) in which two vertices are adjacent if one is stronger than the other in a natural dice game. In The prevalence of “paradoxical” dice [Bull. Inst. Combin. Appl. 45 (2005), 70-76] the dice which are isolated v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Letras (Lima)

سال: 2020

ISSN: 2071-5072,0378-4878

DOI: 10.30920/letras.90.133.10